A Comparison of Input Queuing Cell Switch Architectures
نویسندگان
چکیده
Many proposals of input queuing cell switch architectures have recently appeared in the literature. Some have even found application in commercial very high speed IP routers. In this paper we discuss the pros and cons of input and output queuing switch architectures, we provide a taxonomy of scheduling algorithms for input queuing switches, and we present comparative performance results for some of the recent proposals of input queuing cell switches. Performance is measured in terms of cell loss probability, as well as average, standard deviation, and 99-th quantile of the cell delay with different traffic patterns. The complexity of the algorithms, and the amount of control information to be exchanged inside the switch for their execution, are also discussed.
منابع مشابه
On the Behavior of Input Queuing Switch Architectures
Many proposals of input queuing cell switch architectures have recently appeared in the literature. Some have found application in commercial very high speed IP routers. In this paper we discuss the pros and cons of input and output queuing switch architectures, we provide a taxonomy of scheduling algorithms for input queuing switches, and we present comparative performance results for some of ...
متن کاملHIPIQS: A High-Performance Switch Architecture Using Input Queuing
Switch-based interconnects are used in a number of application domains including parallel system interconnects, local area networks, and wide area networks. However, very few switches have been designed that are suitable for more than one of these application domains. Such a switch must offer both extremely low latency and very high throughput for a variety of different message sizes. While som...
متن کاملHigh Speed Networks SCHEDULING IN INPUT-QUEUED CELL-BASED PACKET SWITCHES*
Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches operating onfied-size data units. In this paper we consider the case of packet switches, i.e., devices operating on variablesize data units at their interfaces, b...
متن کاملScheduling in Input-queued Cell-based Packet Switches
Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches operating on fixed-size data units. In this paper we consider the case of packet switches, i.e., devices operating on variablesize data units at their interfaces,...
متن کاملEfficient Scheduling for SDMG CIOQ Switches
Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate...
متن کامل